Some shortened codes from linear codes constructed by defining sets

The puncturing and shortening technologies are two important approaches to construct new linear codes. It is noticed that many works on punctured codes have been done in the past few decades, but till now little research technique has there only a handful references shortened In this paper, we use technology obtain some from constructed by certain special defining sets, explicitly determine their parameters. Some of those optimal or almost optimal.